Supercritical site percolation on the hypercube: small components are small
نویسندگان
چکیده
Abstract We consider supercritical site percolation on the $d$ -dimensional hypercube $Q^d$ . show that typically all components in percolated hypercube, besides giant, are of size $O(d)$ This resolves a conjecture Bollobás, Kohayakawa, and Łuczak from 1994.
منابع مشابه
Accessibility percolation and first-passage site percolation on the unoriented binary hypercube
Inspired by biological evolution, we consider the following socalled accessibility percolation problem: The vertices of the unoriented ndimensional binary hypercube are assigned independent U(0, 1) weights, referred to as fitnesses. A path is considered accessible if fitnesses are strictly increasing along it. We prove that the probability that the global fitness maximum is accessible from the ...
متن کاملMajority Bootstrap Percolation on the Hypercube
In majority bootstrap percolation on a graph G, an infection spreads according to the following deterministic rule: if at least half of the neighbours of a vertex v are already infected, then v is also infected, and infected vertices remain infected forever. Percolation occurs if eventually every vertex is infected. The elements of the set of initially infected vertices, A ⊂ V (G), are normally...
متن کاملPercolation with small clusters on random graphs
We consider the problem of finding an induced subgraph in a random dregular graph such that its components have bounded size as the size of the graph gets arbitrarily large. We show that for any threshold τ , the largest size density of such an induced subgraph with component sizes bounded by τ is at most 2(log d)/d for asymptotically large d. A matching lower bound is known for independent set...
متن کاملExact solution of site and bond percolation on small-world networks.
We study percolation on small-world networks, which has been proposed as a simple model of the propagation of disease. The occupation probabilities of sites and bonds correspond to the susceptibility of individuals to the disease, and the transmissibility of the disease respectively. We give an exact solution of the model for both site and bond percolation, including the position of the percola...
متن کاملFirst passage percolation on the Newman-Watts small world model
The Newman-Watts model is given by taking a cycle graph of n vertices and then adding each possible edge (i, j), |i− j| 6 = 1 mod n with probability ρ/n for some ρ > 0 constant. In this paper we add i.i.d. exponential edge weights to this graph, and investigate typical distances in the corresponding random metric space given by the least weight paths between vertices. We show that typical dista...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability & Computing
سال: 2022
ISSN: ['0963-5483', '1469-2163']
DOI: https://doi.org/10.1017/s0963548322000323